Existence Verification for Higher Degree Singular Zeros of Complex Nonlinear Systems∗
نویسندگان
چکیده
Abstract. It is known that, in general, no computational techniques can verify the existence of a singular solution of the nonlinear system of n equations in n variables within a given region x of n-space. However, computational verification that a given number of true solutions exist within a region in complex space containing x is possible. That can be done by computation of the topological degree. In a previous paper, we presented theory and algorithms for the simplest case, when the rank-defect of the Jacobi matrix at the solution is one and the topological index is 2. Here, we will generalize that result to arbitrary topological index d ≥ 2: We present theory, algorithms, and experimental results. We also present a heuristic for determining the degree, obtaining a value that we can subsequently verify with our algorithms.
منابع مشابه
Existence Verification for Singular Zeros of Real Nonlinear Systems
Abstract. Traditional computational fixed point theorems, such as the Kantorovich theorem (made rigorous with directed roundings), Krawczyk’s method, or interval Newton methods use a computer’s floating-point hardware computations to mathematically prove existence and uniqueness of a solution to a nonlinear system of equations within a given region of n-space. Such computations require the Jaco...
متن کاملExistence Verification for Higher Degree Singular Zeros of Nonlinear Systems
Finding approximate solutions to systems of n nonlinear equations in n real variables is a much studied problem in numerical analysis. Somewhat more recently, researchers have developed numerical methods to provide mathematically rigorous error bounds on such solutions. (We say that we “verify” existence of the solution within those bounds on the variables.) However, when the Jacobi matrix is s...
متن کاملExistence verification for singular and nonsmooth zeros of real nonlinear systems
Traditional computational fixed point theorems, such as the Kantorovich theorem (made rigorous with directed roundings), Krawczyk’s method, or interval Newton methods use a computer’s floating-point hardware computations to mathematically prove existence and uniqueness of a solution to a nonlinear system of equations within a given region of n-space. Such computations require the Jacobi matrix ...
متن کاملExistence Verification for Singular Zeros of Complex Nonlinear Systems
Computational fixed point theorems can be used to automatically verify existence and uniqueness of a solution to a nonlinear system of n equations in n variables ranging within a given region of n-space. Such computations succeed, however, only when the Jacobi matrix is nonsingular everywhere in this region. However, in problems such as bifurcation problems or surface intersection problems, the...
متن کاملExistence Verification for Singular Zeros of Nonlinear Systems ∗
Computational fixed point theorems can be used to automatically verify existence and uniqueness of a solution to a nonlinear system of equations F (x) = 0, F : R n → R n within a given region x of n-space. But such computations succeed only when the Jacobi matrix F (x) is nonsingular everywhere in x. However, in many practical problems, the Jacobi matrix is singular, or nearly so, at the soluti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001